/*
Generate Parentheses

Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.

For example, given n = 3, a solution set is:

"((()))", "(()())", "(())()", "()(())", "()()()"

*/

#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <fstream>
#include <sstream>
#include <unordered_set>
#include <unordered_map>
#include "print.h"
using namespace std;

/**
* Definition for binary tree*/
typedef __int32 uint32_t;


void testForStack()
{
	stack<int> mystack;
	mystack.push(10);
	mystack.push(20);
	mystack.top() -= 5;
	cout << "mystack.top() is now " << mystack.top() << endl;
}

void testForIntToString()
{
	int a = 10;
	stringstream ss;
	ss << a;
	string str = ss.str();
	cout << str << endl;

	string str1 = to_string(a);

}
/*

alpMap[1] = "A";
alpMap[2] = "B";
alpMap[3] = "C";
alpMap[4] = "D";
alpMap[5] = "E";
alpMap[6] = "F";
alpMap[7] = "G";
alpMap[8] = "H";
alpMap[9] = "I";
alpMap[10] = "J";
alpMap[11] = "K";
alpMap[12] = "L";
alpMap[13] = "M";
alpMap[14] = "N";
alpMap[15] = "O";
alpMap[16] = "P";
alpMap[17] = "Q";
alpMap[18] = "R";
alpMap[19] = "S";
alpMap[20] = "T";
alpMap[21] = "U";
alpMap[22] = "V";
alpMap[23] = "W";
alpMap[24] = "X";
alpMap[25] = "Y";
alpMap[26] = "Z";
*/

class Solution {
public:

	void mediuGP(vector<string> &result, string &s, int n, int leftNum, int rightNUm)
	{	
		if ((n==leftNum)&&(n==rightNUm))
		{
			result.push_back(s);
		}
		if (leftNum <n)
		{
			s.push_back('(');
			mediuGP(result,s,n,leftNum+1,rightNUm);
			s.pop_back();
		}
		if (rightNUm <leftNum)
		{
			s.push_back(')');
			mediuGP(result, s, n, leftNum, rightNUm+1);
			s.pop_back();
		}
	}


	vector<string> generateParenthesis(int n) {
		vector<string> result;
		
		if (n == 0)
		{
			return result;
		}
		
		string s;

		mediuGP(result,s,n,0,0);
		return result;

	}
};


int main(int argc, char* argv[])
{

	//string str1;
	int a;

	for (int i = 1; i < argc; i++){


		cout << argv[i] << endl;
		a = atoi(argv[i]);
	}


	string str2 = "23";
//	char a = str2[2];
	char one = '1';
	int num = str2[1] - '0';

	string str3 = str2 + str2[1];
	cout << num << endl;

	Solution s;
	vector<string> vecStr;
	vecStr = s.generateParenthesis(a);

	//stackTree.push(p->left);
	//stackTree.push(p->right);

	//ListNode *headA = new ListNode(1);
	//ListNode *pa1 = new ListNode(2);
	//ListNode *pa2 = new ListNode(3);
	//headA->next = pa1;
	//pa1->next = pa2;

	//ListNode *headB = new ListNode(4);
	//ListNode *pa1 = new ListNode(2);
	//ListNode *pa2 = new ListNode(3);
	//headA->next = pa1;
	//pa1->next = pa2;







	system("pause");
	return 0;
}